Comparison of different classes of service curves in network calculus

نویسندگان

  • Anne Bouillard
  • Laurent Jouhet
  • Eric Thierry
چکیده

In envelope-based models for worst-case performance evaluation like Network Calculus or Real-Time Calculus, several types of service curves have been introduced to quantify some deterministic service guarantees. This paper studies the expressiveness of those different definitions of service curves. We revisit the hierarchy ranging from the most restrictive definition linked to variable capacity nodes to the most general definition of simple service curves. We state the conditions when the different definitions overlap and discuss the existence of canonical descriptions for systems specified through those definitions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Service curves in Network Calculus: dos and don’ts

This report is a survey about service curves used in envelope-based models for worstcase performance evaluation, like Network Calculus or Real-Time Calculus. In a first part, we compare different models and their notions of service curves by establishing a hierarchy and similarities between different types of service curves and in a second part, we compare the behaviours of simple and strict se...

متن کامل

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

A Novel Fuzzy Logic Base Scheduling Mechanism for Service Differentiation in IP Networks

Quality of Service (QoS) refers to a set of rules or techniques that help the network administrators use the available network resources optimally to manage the effects of congestion and to treat the applications according to their needs. The differentiated services architecture (DiffServ) allows providing quality of service to users. The major DiffServ premise is that individual flows with sim...

متن کامل

New stochastic network calculus for loss analysis

Recently some stochastic (probabilistic) extensions of the deterministic network calculus have been developed, mainly for exploiting the statistical multiplexing of flows aggregated in packet based communication networks. This exploitation could result ”better” stochastic performance bounds than those bounds provided by the inherently worst case analysis of the deterministic network calculus. T...

متن کامل

Worst-case Analysis of Tandem Queueing Systems Using Network Calculus

In this chapter we show how to derive performance bounds for tandem queueing systems using Network Calculus, a deterministic theory for performance analysis. We introduce the basic concepts of Network Calculus, namely arrival and service curves, and we show how to use them to compute performance bounds in an end-to-end perspective. As an application of the above theory, we evaluate tandems of n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010